The greedy approach to dictionary-based static text compression can be executed by a finite-state machine. \udWhen it is applied in parallel to different blocks of data independently, there is no lack of robustness \udeven on standard large scale distributed systems with input files of arbitrary size. Beyond standard large \udscale, a negative effect on the compression effectiveness is caused by the very small size of the data blocks.\udA robust approach for extreme distributed systems is presented in this paper, where this problem is fixed by \udoverlapping adjacent blocks and preprocessing the neighborhoods of the boundaries.
展开▼
